package history.hot100.simple;

import history.hot100.TreeNode;

// 104. 二叉树的最大深度:https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
public class LeetCode_104 {
    public int maxDepth(TreeNode root) {
        if (root == null) return 0;
        return 1+Math.max(maxDepth(root.left), maxDepth(root.right));
    }
}
